Minimizing Total Tardiness on a Single Machine Using Ant Colony Optimization
نویسندگان
چکیده
Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem. The paper introduces an Ant Colony Optimization approach to solve the problem of determining a job-sequence that minimizes the overall tardiness for a given set of jobs to be processed on a single, continuously available machine, the Single Machine Total Tardiness Problem. We experiment with various heuristic information as well as with variants for local search. Experiments with 250 benchmark problems with 50 and 100 jobs illustrate that Ant Colony Optimization is an adequate method to tackle the SMTTP.
منابع مشابه
Unrelated Parallel Machines Scheduling Problem Using an Ant Colony Optimization Approach
Total weighted tardiness is a measure of customer satisfaction. Minimizing it represents satisfying the general requirement of on-time delivery. In this research, we consider an ant colony optimization (ACO) algorithm to solve the problem of scheduling unrelated parallel machines to minimize total weighted tardiness. The problem is NP-hard in the strong sense. Computational results show that th...
متن کاملApplying Ant Colony Optimization to Solve the Single Machine Total Tardiness Problem
Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem. The paper introduces an Ant Colony Optimization approach to solve the problem of determining a job-sequence that minimizes the overall tardine...
متن کاملAn Ant Colony Optimization Application to the Single Machine Total Weighted Tardiness Problem
In this extended abstract we present an algorithm based on the Ant Colony Optimization (ACO) metaheuristic for the single machine total weighted tardiness problem, a well known NP–hard scheduling problem. Our ACO algorithm is currently among the best algorithms known for this problem type. In particular, we will discuss three elements that enable it to find very good solutions quickly. These ar...
متن کاملA hybrid algorithm for the single-machine total tardiness problem
We propose a hybrid algorithm based on the Ant Colony Optimization (ACO) meta-heuristic, in conjunction with four well-known elimination rules, to tackle the NP -hard single-machine scheduling problem to minimize the total job tardiness. The hybrid algorithm has the same running time as that of ACO. We conducted extensive computational experiments to test the performance of the hybrid algorithm...
متن کاملA Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...
متن کامل